全文获取类型
收费全文 | 1579篇 |
免费 | 192篇 |
国内免费 | 106篇 |
专业分类
电工技术 | 32篇 |
综合类 | 188篇 |
化学工业 | 200篇 |
金属工艺 | 31篇 |
机械仪表 | 24篇 |
建筑科学 | 416篇 |
矿业工程 | 37篇 |
能源动力 | 174篇 |
轻工业 | 163篇 |
水利工程 | 152篇 |
石油天然气 | 42篇 |
武器工业 | 1篇 |
无线电 | 24篇 |
一般工业技术 | 175篇 |
冶金工业 | 61篇 |
原子能技术 | 17篇 |
自动化技术 | 140篇 |
出版年
2024年 | 2篇 |
2023年 | 36篇 |
2022年 | 66篇 |
2021年 | 93篇 |
2020年 | 74篇 |
2019年 | 75篇 |
2018年 | 64篇 |
2017年 | 86篇 |
2016年 | 73篇 |
2015年 | 79篇 |
2014年 | 97篇 |
2013年 | 73篇 |
2012年 | 121篇 |
2011年 | 113篇 |
2010年 | 105篇 |
2009年 | 97篇 |
2008年 | 90篇 |
2007年 | 83篇 |
2006年 | 79篇 |
2005年 | 49篇 |
2004年 | 36篇 |
2003年 | 37篇 |
2002年 | 41篇 |
2001年 | 33篇 |
2000年 | 20篇 |
1999年 | 19篇 |
1998年 | 19篇 |
1997年 | 8篇 |
1996年 | 17篇 |
1995年 | 15篇 |
1994年 | 12篇 |
1993年 | 6篇 |
1992年 | 6篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 7篇 |
1987年 | 6篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1982年 | 4篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1955年 | 1篇 |
排序方式: 共有1877条查询结果,搜索用时 343 毫秒
31.
松花江公路大桥所处环境条件调查及检测 总被引:1,自引:0,他引:1
盖青山 《水利与建筑工程学报》2011,9(1):17-19
在建松花江公路大桥位于东北寒冷地区,其易受冻融循环作用的影响,因此,对大桥所处地区的气温、湿度、降雪量、冰冻时间、年冻融循环次数等进行全面的调查和测试是十分必要的.为之,对大桥的腐蚀环境进行了详细调查,对大桥环境中的侵蚀性气体进行了检测,对大桥区域中的大气降水及松花江水质进行了分析,并对河床泥土侵蚀性离子进行了综合测试... 相似文献
32.
Evolutionary algorithms are randomized search heuristics, which are applied to problems whose structure is not well understood, as well as to problems in combinatorial optimization. They have successfully been applied to different kinds of arc routing problems. To start the analysis of evolutionary algorithms with respect to the expected optimization time on these problems, we consider the Eulerian cycle problem. We show that a variant of the well-known (1+1) EA working on the important encoding of permutations is able to find an Eulerian tour of an Eulerian graph in expected polynomial time. Altering the operator used for mutation in the considered algorithm, the expected optimization time changes from polynomial to exponential. 相似文献
33.
Aminollah Mahabadi Hamid Sarbazi-Azad Ebrahim Khodaie Keivan Navi 《The Journal of supercomputing》2008,45(1):1-14
This paper proposes an efficient parallel algorithm for computing Lagrange interpolation on k-ary n-cube networks. This is done using the fact that a k-ary n-cube can be decomposed into n link-disjoint Hamiltonian cycles. Using these n link-disjoint cycles, we interpolate Lagrange polynomial using full bandwidth of the employed network. Communication in the
main phase of the algorithm is based on an all-to-all broadcast algorithm on the n link-disjoint Hamiltonian cycles exploiting all network channels, and thus, resulting in high-efficiency in using network
resources. A performance evaluation of the proposed algorithm reveals an optimum speedup for a typical range of system parameters
used in current state-of-the-art implementations.
相似文献
Hamid Sarbazi-AzadEmail: Email: |
34.
为消除非同步采样引起的频谱泄漏,提高电网信号的谐波分析精度,提出了基于级联积分梳状(CIC)抽取滤波器的谐波分析算法。在前端AD过采样的情况下,该算法采用逆向搜索的方法实现非同步采样数据的整周期截断,用基于CIC抽取滤波器变频的方法实现信号采样频率与信号基波频率同步,通过快速傅立叶变换(FFT)得到信号频谱,计算基波及各次谐波的幅值和相位。仿真实验结果及误差分析表明,相对于常规的分析方法,该算法具有较高的测量精度。该算法对于非稳态周期信号的谐波分析只需单周期采样,简单易实现,是一种有效的测量方法。 相似文献
35.
Vimal Singh 《Automatica》2008,44(1):282-285
A novel criterion for the global asymptotic stability of a class of digital filters utilizing single saturation nonlinearity is presented. An example showing the effectiveness of the present criterion is given. 相似文献
36.
CCC has lower hardware complexity than hypercube and is suited for current VLSI technology.LC-permutations are a large set of important permutations frequently used in various parallel computations.Existing routing algorithms for CCC cannot realize LC-permutations without network conflict.We present an algorithm to realize LC-permutations on CCC.The algorithm consists of two periods of inter-cycle transmissions and one period of inner-cycle transmissions.In the inter-cycle transmissions the dimensional links of CCC are used in a “pipeline” manner and in the inner-cycle transmissions the data packets are sorted by a part of its destination address.The algorithm is fast (O(log2N)) and no conflict will occur. 相似文献
37.
38.
39.
We present a simple algorithmic extension of the approximate call‐strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spurious interprocedural cycles are, in a realistic setting, the key reasons for why approximate call‐return semantics in both context‐sensitive and ‐insensitive static analysis can make the analysis much slower than expected. In the approximate call‐strings‐based context‐sensitive static analysis, because the number of distinguished contexts is finite, multiple call‐contexts are inevitably joined at the entry of a procedure and the output at the exit is propagated to multiple return‐sites. We found that these multiple returns frequently create a single large cycle (we call it ‘butterfly cycle’) covering almost all parts of the program and such a spurious cycle makes analyses very slow and inaccurate. Our simple algorithmic technique (within the fixpoint iteration algorithm) identifies and prunes these spurious interprocedural flows. The technique's effectiveness is proven by experiments with a realistic C analyzer to reduce the analysis time by 7–96%. As the technique is algorithmic, it can be easily applicable to existing analyses without changing the underlying abstract semantics, it is orthogonal to the underlying abstract semantics' context‐sensitivity, and its correctness is obvious. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
40.
Oscillations and transfer properties of relay feedback systems with time-delay linear plants 总被引:1,自引:0,他引:1
Igor Boiko Author vitae 《Automatica》2009,45(12):2897-2902
Oscillations and transfer properties of relay feedback systems with linear plants having a dead time (time delay) are considered. Poincare maps are found explicitly in terms of the system parameters. The oscillatory and transfer properties are presented in the format of the locus of a perturbed relay system (LPRS), which represents the continuum of all possible periodic solutions and transfer properties of the system with a given linear plant. Conditions of local orbital asymptotic stability are found in terms of the system parameters. The proposed approach is illustrated by examples. 相似文献